Implicit Computation: an Output-Polynomial Algorithm for Evaluating Straight-Line Programs
نویسنده
چکیده
theory of computation, randomized algorithms, straight-line programs, output-polynomial algorithms Inputless straight-line programs using addition, subtraction and multiplication are considered. An output-polynomial algorithm is given for computing the output of such a program. The program runs in time polynomial in the length of the program and the length of its output. As a consequence, even if intermediate results are exponentially longer than the program, the output can be computed efficiently when the output's size is small. This algorithm also applies to programs with integral inputs if the size of the inputs are considered to be part of the program's size.
منابع مشابه
Straight-line computation of the polynomial matrix inverse
We present an inversion algorithm for nonsingular n × n matrices whose entries are degree d polynomials over a field. The algorithm is deterministic and requires O (̃nd) field operations for a generic input. The “soft Oh” notation O ̃indicates some missing log(nd) factors. The polynomial matrix inverse can thus be computed by a straight-line program whose size is — asymptotically and up to logari...
متن کاملComputing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line programs. Its complexity is polynomial in the number of coefficients of the input system and the degree of the resultant computed.
متن کاملFactorization of Polynomials Given by Straight-Line Programs
An algorithm is developed for the factorization of a multivariate polynomial represented by a straight-line program into its irreducible factors. The algorithm is in random polynomial-time as a function in the input size, total degree, and binary coefficient length for the usual coefficient fields and outputs a straight-line program, which with controllably high probability correctly determines...
متن کاملAsymptotically Optimal Monte Carlo Sparse Multivariate Polynomial Interpolation Algorithms of Straight-Line Program
In this paper, we propose new deterministic interpolation algorithms and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let f be an n-variate polynomial with a degree bound D and and term bound T . Our deterministic algorithms have better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Ca...
متن کاملFaster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is co...
متن کامل